Derivability and Admissibility of Inference Rules in Abstract Hilbert Systems

نویسنده

  • Clemens Grabmayer
چکیده

We give an overview of results, presented in the form of a poster at CSL03/KGC, about a general study of the notions of rule derivability and admissibility in Hilbert-style proof systems. The basis of our investigation consists in the concept of “abstract Hilbert system”, a framework for Hilbert-style proof systems in which it is abstracted from the syntax of formulas and the operational content of rules. We adapt known definitions of rule derivability and admissibility to abstract Hilbert systems, propose two variant notions of rule derivability, s-derivability and m-derivability, and investigate how these four notions are related. Furthermore, we consider relations that compare abstract Hilbert systems with respect to rule admissibility or with respect to one of the three notions of rule derivability, and study their interrelations. Finally, we report of a theorem that describes a correspondence between abstract notions of rule elimination and the notions of rule admissibility and derivability. This paper intends to give a short overview of results presented in the form of a poster with the same title at the 8th Kurt Gödel Colloquium that was jointly held with the conference CSL 2003 in Vienna, Austria, August 25–30, 2003. As it was the case for the poster, also this overview follows closely the report [2] to which we refer the reader for the proofs, for more details and for related results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Abstract Rewriting Systems to Abstract Proof Systems

Some personal recollections on the introduction of ‘abstract proof systems’ as a framework for formulating syntax-independent, general results about rule derivability and admissibility. With a particular eye on the inspiration I owe to Roel de Vrijer: the analogy with abstract

متن کامل

Proof theory for admissible rules

The admissible rules of a logic are the rules under which the set of theorems of the logic is closed. In this paper a Gentzen-style framework is introduced for defining analytic proof systems that derive the admissible rules of various non-classical logics. Just as Gentzen systems for derivability treat sequents as basic objects, for admissibility, sequent rules are basic. Proof systems are def...

متن کامل

Inference Rules in Nelson's Logics, Admissibility and Weak Admissibility

Our paper aims to investigate inference rules for Nelson’s logics and to discuss possible ways to determine admissibility of inference rules in such logics. We will use the technique offered originally for intuitionistic logic and paraconsistent minimal Johannson’s logic. However, the adaptation is not an easy and evident task since Nelson’s logics do not enjoy replacement of equivalences rule....

متن کامل

Semantics as Based on Inference

We may say that logic is the study of consequence; and the pioneers of modern formal logic (especially Hilbert, but also, e.g., the early Carnap) hoped to be able to theoretically reconstruct consequence in terms of the relation of derivability (and, consequently, necessary truth in terms of provability or theoremhood – derivability from an empty set of premises). The idea was that the general ...

متن کامل

A Syntactic Characterization of the Gabbay-de Jongh Logics

Skura [12] syntactically characterised intuitionistic propositional logic among all intermediate logics by means of a Lukasiewicz-style refutation system. Another such syntactic characterisation is given by Iemhoff [5] in terms of admissible rules. Here we offer a bridge between these results. That is to say, we provide sufficient conditions under which admissible rules yield a refutation syste...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003